Optimal capacity in a coordinated supply chain

We consider a supply chain in which a retailer faces a stochastic demand, incurs backorder and inventory holding costs and uses a periodic review system to place orders from a manufacturer. The manufacturer must fill the entire order. The manufacturer incurs costs of overtime and undertime if the order deviates from the planned production capacity. We determine the optimal capacity for the manufacturer in case there is no coordination with the retailer as well as in case there is full coordination with the retailer. When there is no coordination the optimal capacity for the manufacturer is found by solving a newsvendor problem. When there is coordination, we present a dynamic programming formulation and establish that the optimal ordering policy for the retailer is characterized by two parameters. The optimal coordinated capacity for the manufacturer can then be obtained by solving a nonlinear programming problem. We present an efficient exact algorithm and a heuristic algorithm for computing the manufacturer's capacity. We discuss the impact of coordination on the supply chain cost as well as on the manufacturer's capacity. We also identify the situations in which coordination is most beneficial. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于马尔可夫分析的人才拥有量研究

基于马尔可夫分析理论,给出了人才拥有量预测的马尔可夫模型,并且讨论了模型中转移概率的确定及模型的预测质量等问题.     

Optimal timing of switches between product sales for sports and entertainment tickets

Like airlines and hotels, sports teams and entertainment venues can benefit from revenue management efforts for their ticket sales. Teams and entertainment venues usually offer bundles of tickets early in their selling horizon and put single‐event tickets on sale at a later date; these organizations must determine the best time to offer individual tickets because both types of ticket sales consume the same fixed inventory. We model the optimal a priori timing decision for a seller with a fixed number of identical tickets to switch from selling the tickets as fixed bundles to individual tickets to maximize the revenue realized before the start of the performance season. We assume that bundle and single‐ticket customers each arrive according to independent, nonhomogeneous Markovian death processes with a linear death rate that can vary over time and that the benefit from selling a ticket in a package is higher than from selling the ticket individually. We characterize the circumstances in which it is optimal for the seller to practice mixed bundling and when the seller should only sell bundles or individual tickets, and we establish comparative statics for the optimal timing decision for the special case of constant customer arrival rates. We extend our analytical results to find the optimal time for offering two groups of tickets with high and low demand. Finally, we apply the timing model to a data set obtained from the sports industry. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Simultaneous production of market‐specific and global products: A two‐stage stochastic program with additional demand after recourse

This paper analyzes the simultaneous production of market‐specific products tailored to the needs of individual regions and a global product that could be sold in many regions. We assume that the global product costs more to manufacture, but allows the decision concerning the allocation of products to regions to be delayed until after the manufacturing process has been completed. We further assume that there is additional demand after the region allocation but prior to delivery, extending the two‐stage stochastic program with recourse to include additional stochastic demand after the recourse. This scenario arises, for example, when there is additional uncertainty during a delivery delay which might occur with transoceanic shipments. We develop conditions for optimality assuming a single build‐allocate‐deliver cycle and stochastic demand during both the build and deliver periods. The optimal policy calls for the simultaneous production of market‐specific and global products, even when the global product is substantially more costly than the market‐specific product. In addition, we develop bounds on the performance of the optimal policy for the multicycle problem. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 438–461, 2003     

Fixed‐interval joint‐replenishment policies for distribution systems with multiple retailers and stochastic demand

We consider a distribution system consisting of a central warehouse and a group of retailers facing independent stochastic demand. The retailers replenish from the warehouse, and the warehouse from an outside supplier with ample supply. Time is continuous. Most previous studies on inventory control policies for this system have considered stock‐based batch‐ordering policies. We develop a time‐based joint‐replenishment policy in this study. Let the warehouse set up a basic replenishment interval. The retailers are replenished through the warehouse in intervals that are integer multiples of the basic replenishment interval. No inventory is carried at the warehouse. We provide an exact evaluation of the long‐term average system costs under the assumption that stock can be balanced among the retailers. The structural properties of the inventory system are characterized. We show that, although it is well known that stock‐based inventory control policies dominate time‐based inventory control policies at a single facility, this dominance does not hold for distribution systems with multiple retailers and stochastic demand. This is because the latter can provide a more efficient mechanism to streamline inventory flow and pool retailer demand, even though the former may be able to use more updated stock information to optimize system performance. The findings of the study provide insights about the key factors that drive the performance of a multiechelon inventory control system. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 637–651, 2013     

Dynamic service rate control for a single‐server queue with Markov‐modulated arrivals

We consider the problem of service rate control of a single‐server queueing system with a finite‐state Markov‐modulated Poisson arrival process. We show that the optimal service rate is nondecreasing in the number of customers in the system; higher congestion levels warrant higher service rates. On the contrary, however, we show that the optimal service rate is not necessarily monotone in the current arrival rate. If the modulating process satisfies a stochastic monotonicity property, the monotonicity is recovered. We examine several heuristics and show where heuristics are reasonable substitutes for the optimal control. None of the heuristics perform well in all the regimes and the fluctuation rate of the modulating process plays an important role in deciding the right heuristic. Second, we discuss when the Markov‐modulated Poisson process with service rate control can act as a heuristic itself to approximate the control of a system with a periodic nonhomogeneous Poisson arrival process. Not only is the current model of interest in the control of Internet or mobile networks with bursty traffic, but it is also useful in providing a tractable alternative for the control of service centers with nonstationary arrival rates. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 661–677, 2013     

The defence firm of the future

This paper offers the personal view of a senior executive in the Defence Procurement Agency about the future requirements of the defence industry’s principal UK customer. The focus here is on trying to identify the type of corporate behaviour and range of skill sets that the UK Government will need from defence suppliers, both primes and supply chain companies in the future. The concluding message from this ‘Customer View’ is that there is likely to be a continuing market for the company that specializes in delivering defence capability. It will be a company that will be looking for a long‐term relationship, with a specialist knowledge of its various national customers and a willingness to work openly and closely with them. It will be agile in its ability to bring together diverse technologies, to package them as a system and to deliver them either as hardware or as a service. Such suppliers will also need to innovate and to adapt at least as rapidly as the threats that they seek to counter.     

A 17th-century Pikeman's Armour from Antwerp

Abstract

A recent re-examination of the arms and armour collection at the British Museum has led to the identification of a 17th-century pikeman's armour clearly associated with the city of Antwerp in modern Belgium, the only example of its kind. The three pieces: a pot, breastplate and backplate, are part of a collection bequeathed to the museum by William Burges in 1881. All three pieces can be dated to circa 1635 and are stamped with the arms of Antwerp, a stylised depiction of Antwerp castle between two hands derived from the blazon of the Margrave of Antwerp. The armour is indistinguishable from contemporary Dutch production and it is unclear whether it was made in Antwerp or whether the addition of the arms simply suggests a use in the city.     

JXTA网络短链路由改进算法

JXTA为构建对等网络提供了标准化计算平台,制定一些协议和服务专门解决构建P2P网络所遇见的问题.为了改进JXTA路由查询效率低下问题,提出一种路由短链改进算法.在端点路由协议的基础上,根据小世界短链现象采用物理邻居策略将网络划分簇,簇内采用Pastry算法,簇间运用freePastry算法进行资源搜索,使长跳路由减少短链路由增加.通过仿真实验说明,算法可有效增加检索效率,减少节点间的通讯时延.     

基于方位特征序列的地雷鉴别算法

在使用低频超宽带合成孔径雷达(UWB-SAR)对地雷进行探测的过程中,根据目标电磁散射随方位角和入射角的变化特性,提出一种利用双峰间距和频率凹点特征沿方位向变化的隐马尔科夫模型(HMM)鉴别算法。该算法首先针对目标感兴趣区域(ROI)图像估计其各方位回波响应,然后利用时频原子提取时域双峰间距和频率凹点,进而得到随方位角变化的特征序列,再通过SAR工作时方位角和入射角的变化特点以及训练样本确定HMM参数,并在此基础上计算疑似目标新的特征矢量,采用马氏距离进行判别。实验结果表明了本文所提方法在目标鉴别方面的有效性。